Analysis of FIPS 140-2 Test and Chaos-Based Pseudorandom Number Generator
نویسندگان
چکیده
Pseudo random numbers are used for various purposes. Pseudo random number generators (PRNGs) are useful tools to provide pseudo random numbers. The FIPS 140-2 test issued by the American National Institute of Standards and Technologyhas been widely used for the verifications the statistical properties of the randomness of the pseudo random numbers generated by PRNGs. First this paper analyzes the FIPS 140-2 test. The results show that • The required interval of the FIPS140-2 Monobit Test corresponds to the confident interval with significant level α = 0.0001(1− α). • The required interval of the FIPS140-2 Pork Test corresponds to χ test with significant level α = 0.0002(1 α). • The required intervals of the FIPS140-2 Run Test correspond to the confident interval with significant level α = 0.00000016(1− α). Second this study considers a novel chaotic map (NCM), whose prototype is the Lorenz three-dimensional Lorenz chaotic map. A NCP -based CPRNG is designed. Using the FIPS 140-2 test measures the 1000 keystreams randomly generated by the RC4 algorithm, and the 1000 keystreams generated by the CPRNG with perturbed randomly initial conditions in the range | | ∈ [10−16, 10−4]. The results show that the statistical properties of the randomness of the sequences generated via the CPRNG and the RC4 do not have significant differences. The results confirm once again that suitable designed chaos-based PRNGs may generate sound random sequences, in particular for a replacement for the one-time pad system.
منابع مشابه
Chaos Machine: Different Approach to the Application and Significance of Numbers
In this paper we describe a theoretical model of chaos machine, which combines the benefits of hash function and pseudo-random function, forming flexible one-way push-pull interface. It presents the idea to create a universal tool (design pattern) with modular design and customizable parameters, that can be applied where randomness and sensitiveness is needed (random oracle), and where appropri...
متن کاملPractical state recovery attacks against legacy RNG implementations
The ANSI X9.17/X9.31 random number generator is a pseudorandom number generator design based on a block cipher and updated using the current time. First standardized in 1985, variants of this PRNG design were incorporated into numerous cryptographic standards over the next three decades. It remained on the list of FIPS 140-1 and 140-2 approved random number generation algorithms until January 2...
متن کاملRandom Bit Generator Based on Non-Autonomous Chaotic Systems
In the last decade, a very interesting relationship between cryptography and chaos theory was developed. As a result of this close relationship, several chaos-based cryptosystems, especially using autonomous chaotic dynamical systems, have been put forward. However, this chapter presents a novel Chaotic Random Bit Generator (CRBG), which is based on the Poincaré map of a non-autonomous dynamica...
متن کاملBiometric random number generators
Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random bits. We point out that this new approach could be particularly useful to generate seeds for pseudo-random number generators and so-called ‘‘key sessions’’. Our method is very simple and is based on the observation that, for t...
متن کاملTwo Countermeasures Against Hardware Trojans Exploiting Non-Zero Aliasing Probability of BIST
The threat of hardware Trojans has been widely recognized by academia, industry, and government agencies. A Trojan can compromise security of a system in spite of cryptographic protection. The damage caused by a Trojan may not be limited to a business or reputation, but could have a severe impact on public safety, national economy, or national security. An extremely stealthy way of implementing...
متن کامل